Multi-Objective Particle Swarm Optimization Algorithms – A Leader Selection Overview
نویسندگان
چکیده
Multi Objective Optimization (MOO) problem involves simultaneous minimization or maximization of many objective functions. Various MOO algorithms have been introduced to solve the MOO problem. Traditional gradient-based techniques are one of the methods used to solve MOO problems. However, in the traditional gradient-based technique only one solution is generated. Thus, an alternative approach such as Particle Swarm Optimization (PSO), which able to produce a number of possible solutions are highly desirable. In PSO, particles search the optimum solution under the influence of a better solution known as leader. This leader facilitates cooperation between all particles. However, this strategy to select the leader has to be changed when it is used for MOO problems. This paper presents an overview of the multi-objective PSO algorithms, which emphasize on the leader selection. In addition, the description of PSO and multi-objective optimization problems are also provided.
منابع مشابه
PSO for multi-objective problems: Criteria for leader selection and uniformity distribution
This paper proposes a method to solve multi-objective problems using improved Particle Swarm Optimization. We propose leader particles which guide other particles inside the problem domain. Two techniques are suggested for selection and deletion of such particles to improve the optimal solutions. The first one is based on the mean of the m optimal particles and the second one is based on appoin...
متن کاملTask Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids
In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...
متن کاملTask Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids
In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...
متن کاملA Study on the influence of domination control techniques and leader selection methods in Many-Objective Problems
Pareto Based Multi Objective Optimization Algorithms, including Multi-Objective Particle Swarm Optimization (MOPSO), face several problems when applied to Multi Objective Optimization Problems with a large number of objective functions, especially the deterioration of the search ability. In the literature some techniques were proposed to overcome these limitations, among them the modification o...
متن کاملDiscrete Multi Objective Particle Swarm Optimization Algorithm for FPGA Placement (RESEARCH NOTE)
Placement process is one of the vital stages in physical design. In this stage, modules and elements of circuit are placed in distinct locations according to optimization basis. So that, each placement process tries to influence on one or more optimization factor. In the other hand, it can be told unequivocally that FPGA is one of the most important and applicable devices in our electronic worl...
متن کامل